On the reliability exponent of the exponential timing channel

We determine the reliability exponent ( ) of the Anantharam–Verdú exponential server timing channel with service rate for all rates between a critical rate = ( 4) log 2 and the channel capacity = 1 . For rates between 0 and , we provide a random-coding lower bound ( ) and a sphere-packing upper bound ( ) on ( ). We also determine that the cutoff rate 0 for this channel equals 4, thus answering a question posed by Sundaresan and Verdú. An interesting aspect of our results is that the lower bound ( ) for the reliability exponent of the timing channel coincides with Wyner’s reliability exponent for the photon-counting channel with no dark current and with peak power constraint . Whether the reliability exponents of the two channels are actually equal everywhere remains open. This shows that the exponential server timing channel is at least as reliable as this type of a photoncounting channel for all rates.